/****************
*PID:div2
*Auth:Jonariguez
*****************
*/
#define lson k*2,l,m
#define rson k*2+1,m+1,r
#define rep(i,s,e) for(i=(s);i<=(e);i++)
#define For(j,s,e) For(j=(s);j<(e);j++)
#define sc(x) scanf("%d",&x)
#define In(x) scanf("%I64d",&x)
#define SS(x,y) scanf("d",&x,&y)
#define pf(x) printf("%d",x)
#define pfn(x) printf("%d\n",(x))
#define Pf(x) printf("%I64d",(x))
#define Pfn(x) printf("%I64d\n",(x))
#define Pc printf(" ")
#define PY puts("YES")
#define PN puts("NO")
#define MP make_pair
#define X first
#define Y second
#define PI acos(-1.0)
#include <stdio.h>
#include <string.h>
#include <string>
#include <math.h>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
typedef long long LL;
typedef int Ll;
Ll quick_pow(Ll a,Ll b,Ll MOD){a%=MOD;Ll res=1;while(b){if(b&1)res=(res*a)%MOD;b/=2;a=(a*a)%MOD;}return res;}

const int maxn=200000+10;
const int MOD=1e9+7;
int a[maxn],b[maxn];

vector<int> res;

void change(int x,int y){
    for(int i=x;i<=y;i+=2)
        swap(a[i],a[i+1]);
}

int main()
{
    int i,j,n,m;
    while(scanf("%d",&n)!=EOF){
        for(i=1;i<=n;i++){
            sc(a[i]);
            b[i]=a[i];
        }
        sort(b+1,b+n+1);
        int now=1;
        res.clear();
        for(int p=1;p<=n;p++){
            int x=b[p];
            for(i=n;i>=now;i--)
                if(a[i]==x) break;
            while(i>now+1){
                if((i-now+1)%2==0){
                    res.push_back(now);res.push_back(i);
                    change(now,i);
                }else {
                    res.push_back(now+1);res.push_back(i);
                    change(now+1,i);
                }
                i--;
            }
            if(i==now+1){
                res.push_back(now);res.push_back(i);
                change(now,i);
            }
            now++;
        }
        for(i=0;i<res.size();i+=2)
            printf("%d %d\n",res[i],res[i+1]);

    }
    return 0;
}

